Image Landmark Recognition with Hierarchical K-Means Tree

نویسندگان

  • Magdalena Rischka
  • Stefan Conrad
چکیده

Today’s giant-sized image databases require content-based techniques to handle the exploration of image content on a large scale. A special part of image content retrieval is the domain of landmark recognition in images as it constitutes a basis for a lot of interesting applications on web images, personal image collections and mobile devices. We build an automatic landmark recognition system for images using the Bag-of-Words model in combination with the Hierarchical K-Means index structure. Our experiments on a test set of landmark and non-landmark images with a recognition engine supporting 900 landmarks show that large visual dictionaries of size about 1M achieve the best recognition results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stanford Navigation Android Phone Navigation System based on the SIFT image recognition algorithm

A mobile navigation system is developed based on landmark detection. SIFT and a Hierarchical K-means tree are used to create a database of images of landmarks around Stanford University. A user takes a picture from their Android device and sends the query to a server running MATLAB. Correspondences are found and RANSAC is used to determine the best match. After receiving their location, the use...

متن کامل

IMRESTAURANT() MATLAB for Feature-based Restaurant Logo Recognition

This paper discusses the implementation of imrestaurant(), a MATLAB function for feature-based restaurant logo recognition. The algorithm works by first applying SIFT to a logo database and then creating a hierarchical vocabulary tree using K-means clustering. The input to the algorithm is a photograph of an image logo, which is first filtered to reduce noise. Then SIFT is applied to the input ...

متن کامل

A Tree-Based Approach to Integrated Action Localization, Recognition and Segmentation

A tree-based approach to integrated action segmentation, localization and recognition is proposed. An action is represented as a sequence of joint hog-flow descriptors extracted independently from each frame. During training, a set of action prototypes is first learned based on a k-means clustering, and then a binary tree model is constructed from the set of action prototypes based on hierarchi...

متن کامل

Organic Shapes Classification by Similarity to Basic Geometric Shapes

This paper proposes and describes a novel technique for organic shapes classification by similarity to basic geometric shapes. The amber data used in experiments are collected by amber art craft industry experts and the presented investigations were care out in order to develop a classifier for online amber sorting application. The centroid distance function was selected for shape representatio...

متن کامل

K-means Iterative Fisher (KIF) unsupervised clustering algorithm applied to image texture segmentation

The K-means Iterative Fisher (KIF) algorithm is a robust, unsupervised clustering algorithm applied here to the problem of image texture segmentation. The KIF algorithm involves two steps. First, K-means is applied. Second, the K-means class assignments are used to estimate parameters required for a Fisher linear discriminant (FLD). The FLD is applied iteratively to improve the solution. This c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015